Method and apparatus for secure data transmission

ABSTRACT

A method and apparatus for secured data transmission is provided. The base station determines a first precoding matrix based on channel information of an eavesdropper. The base station determines a second precoding matrix and a third precoding matrix. The base station generates the secure data by precoding first user data for a target user with the first precoding matrix and the second precoding matrix. The base station transmits the secure data signal to the target user. The second precoding matrix is determined based on the first precoding matrix and the first channel information. The third precoding matrix is determined based on the first channel information and the second channel information.

CROSS-REFERENCE TO RELATED APPLICATION

Pursuant to 35 U.S.C. §119(e), this application claims the benefit of U.S. Provisional Patent Application Ser. No. 61/611,019, filed on Mar. 15, 2012, and U.S. Provisional Patent Application Ser. No. 61/751,222, filed on Jan. 10, 2013, the contents of which are all hereby incorporated by reference herein in their entirety.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to data transmission schemes and more specifically to a method and apparatus for secure data transmission.

2. Related Art

Information security of wireless communications has become a very important issue with a growing number of wireless communication applications. Due to the broadcast nature of wireless medium, the wireless security is inherently more vulnerable than the wired security. In wireless networks, the eavesdropper may overhear signals transmitted from a transmitter and interpret the messages more easily than in wired networks.

In most of the existing methods to guarantee the security of transmitting signals, a transmitter generates signals coded by cryptography. Both a transmitter transmitting the signals coded by cryptography and a receiver receiving the signals coded by cryptography should have secret key to guarantee the security of the signals. Wireless communication system should perform key management to decode the signal coded by cryptography. However, performing the key management in a wireless communication system can be difficult and complex process. To overcome the difficult and complex operation of the key management in the wireless communication system, physical layer security techniques have been proposed.

Most of the works in the area of physical layer security have focused only on the scenario of point-to-point communications, i.e., the single user case, which typically involves one transmitter and one receiver in the presence of an eavesdropper. The natural extension is to consider multiple users. In particular, the case of multiple (legitimate) receivers, known as the broadcast channel (BC), is an important scenario.

Most of the works in the area of physical layer security are also based on an assumption which the eavesdropper's channel was assumed to be a degraded version of the legitimate user's channel. Later, This assumption should be extended to the non-degraded case, where the eavesdropper's channel is not necessarily a degraded version of the legitimate user's channel, and also applied to Gaussian channels.

SUMMARY OF THE INVENTION

The present invention provides secure transmission methods for a multi-user multiple-input multiple-output (MIMO) broadcast channel in the presence of at least one eavesdropper with multiple antennas.

The present invention also provides secure transmission apparatuses for a MIMO broadcast channel in the presence of at least one eavesdropper with multiple antennas.

According to the embodiments of the present invention, Eve can not receive data when channel information of Eve is known to a base station, and Eve can not demodulate received data properly when channel information of Eve is not known to the base station. Furthermore, the embodiment of the present invention can be applied to a multi-user MIMO system including many users having different security policy.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a flowchart illustrating the secure data transmission method when a base station knows perfect CSI (channel state information) of Eve.

FIG. 2 is a conceptual view illustrating the signal received by Eve when the base station does not know channel information of Eve.

FIG. 3 is a conceptual view illustrating an embodiment of the received signal power of the secret data at Eve.

FIG. 4 is a conceptual view illustrating an embodiment of the jamming power proportional to the received signal power of the secret data.

FIG. 5 is a flowchart illustrating the secure data transmission method when a base station does not know perfect CSI of Eve.

FIG. 6 is a block diagram showing a BS (base station) and a UE (user equipment).

DESCRIPTION OF EXEMPLARY EMBODIMENTS

A multi-user multiple-input multiple-output (MIMO) system composed of a base station with N transmit antennas and K legitimate users may be assumed to transmit and receive secret data. These legitimate users will be called simply users whenever there is no ambiguity. It may be also assumed that there exists one eavesdropper with M_(E) receive antennas, which will be called Eve. In this work, the K legitimate users may be classified into two different groups.

(1) Group A: For each user in this group, the data must be kept secret at the physical layer from all other users as well as Eve.

(2) Group B: For each user in this group, the data do not need to be kept secret at the physical layer from any other users or Eve.

This model of two-groups can be considered as a generalization of the purely insecure system or the purely secure system: when Group A is empty, the system reduces to the purely insecure system; and when Group B is empty, the system reduces to the purely secure system. Also, the model of two-groups is useful when there exist some users who are downloading their personal data and the other users who are downloading publicly opened data such as web-browsing of newspapers. Or, one may consider the case of cross-layer optimization between the physical layer security and the cryptography. In this case, the users in Group B are the users for whom the secure links have been successfully established at a higher layer and the data are encrypted. For these users, therefore, the data may not need to be additionally secured at the physical layer. On the other hand, the users in Group A are the users for whom the secure links have not been established yet. Note that, until the establishment of secure links, the data including management frames of those users are not encrypted. For those users, therefore, it should be a good strategy to secure the data at the physical layer.

For Group A, the total number of users is denoted by K_(A), the number of receive antennas for the k-th user is denoted by M_(k) ^(A), and the total number of receive antennas is denoted by Σ_(k=1) ^(K) ^(A) M_(K) ^(A)=M_(A).

For Group B, the total number of users is denoted by K_(B), number of receive antennas for the k-th user is denoted by M_(k) ^(B), and the total number of receive antennas is denoted by Σ_(k=1) ^(K) ^(B) M_(k) ^(B)=M_(B).

The total number of receive antennas of all users excluding Eve is denoted by M, i.e., M_(A)+M_(B)=M. The base station may transmit N_(k) ^(A) data signals denoted by x_(k) ^(A)=[x_(k,1) ^(A), . . . , x_(k) ^(A), N_(k) ^(A)]^(T) to the k-th user of Group A and transmit N_(k) ^(B) data signals denoted by x_(k) ^(B)=[x_(k,1) ^(B), . . . , x_(k) ^(B), N_(k) ^(B)]^(T) to the k-th user of Group B.

In order to transmit the data reliably and secretly, the data may be precoded by N×N_(k) ^(A) precoding matrices T_(k) ^(A) for the users in Group A and by N×N_(k) ^(B) precoding matrices T_(k) ^(B) for the users in Group B. In other words, each precoding matrix T_(k) ^(A) and T_(k) ^(B) multiplies by the transmitting data x_(k) ^(A) and x_(k) ^(B) respectively. Then the total transmitted signal, denoted by N×1 vector x, is given by:

$\begin{matrix} {x = {{\sum\limits_{i = 1}^{K_{A}}{T_{i}^{A}x_{i}^{A}}} + {\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}}} & {\langle{{equation}\mspace{14mu} 1}\rangle} \end{matrix}$

where it is assumed that the number of symbol transmitted to user satisfies the conditions N_(k) ^(A)≦M_(k) ^(A), N_(k) ^(B)≦M_(k) ^(B), and It is also assumed that transmitting signal vector satisfies the conditions E[x_(i) ^(A)]=E[x_(i) ^(B)]=0, E[x_(i) ^(A)(x_(i) ^(A))^(H)]=E[x_(i) ^(B)(x_(i) ^(B))^(H)]=I, and E[x_(i) ^(A)(x_(i) ^(B))^(H)]=0.

Considering the receiver, the received signals r_(k) ^(A) of user k in Group A r_(k) ^(B) and user k in Group B are given by:

$\begin{matrix} {{{r_{k}^{A} = {{H_{k}^{A}{\sum\limits_{i = 1}^{K_{A}}{T_{i}^{A}x_{i}^{A}}}} + \eta_{k}^{A}}},{k = 1},\ldots \mspace{14mu},K_{A}}{{r_{k}^{B} = {{H_{k}^{B}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + \eta_{k}^{B}}},{k = 1},\ldots \mspace{14mu},K_{B}}} & {\langle{{equation}\mspace{14mu} 2}\rangle} \end{matrix}$

where H_(k) ^(A) is an M_(k) ^(A)×N matrix representing the channel from the base station to the k-th user in Group A and η_(k) ^(A) represents the additive white Gaussian noise (AWGN) at the k-th user in Group A. For Group B, H_(k) ^(B) and η_(k) ^(B) are defined in the same way. The received signal at Eve represented by M_(E)×1 matrix is given by:

$\begin{matrix} {r_{E} = {{H_{E}{\sum\limits_{i = 1}^{K_{A}}{T_{i}^{A}x_{i}^{A}}}} + {H_{E}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + \eta_{E}}} & {\langle{{equation}\mspace{14mu} 3}\rangle} \end{matrix}$

where H_(E) is an M_(E)×N matrix representing the channel from the base station to Eve and η_(E) is an M_(E)33 1 column vector representing the AWGN at Eve. A condition E[η_(E)(η_(E))^(H)]=N_(E) I_(M) _(E) is always satisfied.

In an embodiment of the present invention, it is always assumed that the CSI (channel state information), H_(K) ^(A) and H_(k) ^(B) of the legitimate users are perfectly known at the base station. The CSI H_(E) of Eve, however, is assumed to be perfectly known or imperfectly known, which are considered in the embodiments of present invention described respectively.

1. Data transmission method when a base station knows perfect CSI of Eve.

The embodiment of present invention describes the case that H_(E) (CSI of Eve) is perfectly known at the base station. The signal transmitted by the base station should be satisfy two objectives: i) the data x_(k) ^(A) should be kept secret from all other users in Group A, all users in Group B, and Eve; and ii) the data x_(k) ^(A) and x_(k) ^(B) should be reliably received by their intended users. In order to achieve the objectives, we set precoding matrix T_(k) ^(A) as follows:

T _(K) ^(A) =T _(1,k) ^(A) T _(2,k) ^(A)  <equation 3>

where T_(1,k) ^(A) is an N×L_(k) ^(A) matrix designed to achieve the first objective and T_(2,k) ^(A) is an L_(k) ^(A)×N_(k) ^(A) matrix designed to achieve the second objective. L_(k) ^(A) may be selected to satisfy L_(K) ^(A)≧N_(k) ^(A).

Firstly, for secure data transmission of the first objective, T_(1,k) ^(A) is designed such that it is orthogonal to the channels of all other legitimate users and Eve as follows:

H _(i) ^(A) T _(1,k) ^(A) =O, i=1, . . . ,k−1, k+1, . . . , K _(A)

H _(i) ^(B) T _(1,k) ^(A) =O, i=1, . . . ,K _(B)

H _(E) T _(1,k) ^(A) =O  <equation 4>

where O is a matrix, elements of which are all zero. T_(1,k) may be calculated by performing singular value decomposition (SVD) to the matrix

_(i). The matrix

_(i) is given as follows:

$\begin{matrix} \begin{matrix} {H_{i} = \begin{bmatrix} {H_{E}^{T},{\left( H_{1}^{A} \right)T},\ldots \mspace{14mu},\left( H_{i - 1}^{A} \right)^{T},} \\ {\left( H_{K_{A}}^{A} \right)^{T},\left( H_{1}^{B} \right)^{T},\ldots \mspace{14mu},\left( H_{K_{B}}^{B} \right)^{T}} \end{bmatrix}^{T}} \\ {= {U_{i}{\Lambda_{i}\left\lbrack {V_{i},{\overset{\sim}{V}}_{i}} \right\rbrack}^{H}}} \end{matrix} & {\langle{{equation}\mspace{14mu} 5}\rangle} \end{matrix}$

where U_(i) is an M_(E)+M−m_(i) ^(A))×(M_(E)+M−M_(i) ^(A)) unitary matrix composed of the left singular vectors of

_(i); Λ_(i) is an (M_(E)+M−M_(i) ^(A))×N matrix composed of the singular values of

_(i); V_(i) is an N×(M_(E)+M−M_(i) ^(A)) matrix composed of the right singular vectors corresponding to the non-zero singular values; and {tilde over (V)}_(i) is an N×(N−(M_(E)+M−M_(i) ^(A))) matrix composed of the right singular vectors corresponding to the zero singular values. Selecting L_(K) ^(A) columns from V _(k), matrix V _(k) can be an N×L_(k) ^(A) matrix. V _(k) may be used as T_(1,k) ^(A) as follows:

T _(1,k) ^(A) = V _(k)  <equation 6>

where the condition of N−(M_(E)+M−M_(k) ^(A))≧L_(k) ^(A)≧N_(k) ^(A) must be satisfied. This method described above may be called block diagonalization (BD) to transmit the secure data.

With the precoding of T_(1,k) ^(A), the received signals at the users and Eve are given as follows:

$\begin{matrix} \begin{matrix} {r_{k}^{A} = {{H_{k}^{A}\left( {\sum\limits_{i = 1}^{K_{A}}{T_{i}^{A}x_{i}^{A}}} \right)} + {H_{k}^{A}\left( {\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}} \right)} + \eta_{k}^{A}}} \\ {= {{H_{k}^{A}T_{1,k}^{A}T_{2,k}^{A}x_{k}^{A}} + {H_{k}^{A}\left( {\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}} \right)} + \eta_{k}^{A}}} \end{matrix} & {\langle{{equation}\mspace{14mu} 7}\rangle} \\ \begin{matrix} {r_{k}^{B} = {{H_{k}^{B}\left( {\sum\limits_{i = 1}^{K_{A}}{T_{i}^{A}x_{i}^{A}}} \right)} + {H_{k}^{B}\left( {\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}} \right)} + \eta_{k}^{B}}} \\ {= {{H_{k}^{B}T_{k}^{B}x_{k}^{B}} + {H_{k}^{B}\left( {\overset{K_{B}}{\sum\limits_{{i = 1},{i \neq k}}}{T_{i}^{B}x_{i}^{B}}} \right)} + \eta_{k}^{B}}} \end{matrix} & \; \\ \begin{matrix} {r_{E} = {{H_{E}\left( {\sum\limits_{i = 1}^{K_{A}}{T_{i}^{A}x_{i}^{A}}} \right)} + {H_{E}\left( {\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}} \right)} + \eta_{E}}} \\ {= {{H_{E}\left( {\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}} \right)} + \eta_{E}}} \end{matrix} & \; \end{matrix}$

From the received signals, it is clear that the secret data x_(k) ^(A) is perfectly eliminated at all other users in Group A, all users in Group B, and Eve. The secret data x_(k) ^(A) is only transmitted to the k-th user in Group A. Perfect secrecy is achieved in this case as shown above equation 7.

Secondly, for reliable data transmission, i.e., the second objective, T_(2,k) ^(A) and T_(k) ^(B) may be generated such that the mean squared error between the transmit and receive signals is minimized. In particular to suppress the effect of the noise, the received signal vector is scaled by a weighting factor β. The optimum precoders are derived as follows:

$\begin{matrix} {\min\limits_{{\{ T_{2,k}^{A}\}},{\{ T_{k}^{B}\}},\beta}\left\lbrack {{{\beta^{- 1}r_{AB}} - x_{AB}}}^{2} \right\rbrack} & {\langle{{equation}\mspace{14mu} 8}\rangle} \end{matrix}$

subject E[∥x∥²]=P_(Tot),

where x_(AB)=[(x₁ ^(A))^(T), . . . , (x_(K) _(A) ^(A))^(T), (x₁ ^(B))^(T), . . . , (x_(K) _(B) ^(B))^(T)]^(T) and

The solution is given as follows:

$\begin{matrix} {\mspace{20mu} {{T_{2,k}^{A} = {\beta \; {\overset{\_}{T}}_{2,k}^{A}}}\mspace{20mu} {T_{k}^{B} = {\beta \; {\overset{\_}{T}}_{k}^{B}}}\mspace{20mu} {\beta = \left( \frac{P_{Tot}}{{\sum\limits_{i = 1}^{K_{A\;}}{{T_{1,i}^{A}{\overset{\_}{T}}_{2,i}^{A}}}^{2}} + {\sum\limits_{i = 1}^{K_{B}}{{\overset{\_}{T}}_{i}^{B}}^{2}}} \right)^{1/2}}\mspace{20mu} {{\overset{\_}{T}}_{2,k}^{A} = {\left( {{\left( {H_{k}^{A}T_{1,k}^{A}} \right)^{H}H_{k}^{A}T_{1,k}^{A}} + {\frac{\overset{\_}{N}}{P_{Tot}}I}} \right)^{- 1}\left( {H_{k}^{A}T_{1,k}^{A}} \right)^{H}}}{{\overset{\_}{T}}_{k}^{B} = {\left( {{\sum\limits_{i = 1}^{K_{A}}{\left( H_{i}^{A} \right)^{H}H_{i}^{A}}} + {\sum\limits_{i = 1}^{K_{B}}{\left( H_{i}^{B} \right)^{H}H_{i}^{B}}} + {\frac{\overset{\_}{N}}{P_{Tot}}I}} \right)^{- 1}\left( H_{k}^{B} \right)^{H}}}\mspace{20mu} {where}\mspace{20mu} {\overset{\_}{N} = {{\sum\limits_{i = 1}^{K_{A}}{N_{i}^{A}M_{i}^{A}}} + {\sum\limits_{i = 1}^{K_{B}}{N_{i}^{B}{M_{i}^{B}.}}}}}}} & {\langle{{equation}\mspace{14mu} 9}\rangle} \end{matrix}$

If all users in the system are in Group A (K_(B)=0), The precoding matrix T_(k) ^(A)=T_(k,1) ^(A) T_(k,2) ^(A) eliminates the interference of other users by Block Diagonalization (BD) and eliminates the interference between symbols by MMSE (minimum mean square error).

On the contrary, If all users in the system are in Group B (K_(A)=0), The precoding matrix T_(k) ^(B) eliminates the interference of other users by block diagonalization (BD) and the interference between symbols by minimum mean square error (MMSE).

The embodiment of the present invention assumes the general case there are two user groups (Group A, Group B) having different data security requirements. The result represents general precoding matrixes when there are two groups having different data security requirement (K_(A)≠0, K_(B)≠0).

FIG. 1 is a flowchart illustrating the secure data transmission method when a base station knows perfect CSI of Eve.

FIG. 1 illustrates the secure data generating method of the base station.

According to FIG. 1, a base station generates the first precoding matrix based on exact channel information of Eve (step S100).

A procedure of generating the first precoding matrix T_(1,k) ^(A) is described through the equation 4, 5 and 6. The first precoding matrix is a precoding matrix applying to data transmitting to the users in Group A, the data transmitting to whom must be kept secret at the physical layer from all other users as well as Eve. The first precoding matrix T_(1,k) ^(A) can be used for protecting users' data in Group A from other users.

The base station generates the second precoding matrix and the third precoding matrix (step S110).

The second precoding matrix T_(2,k) ^(A) and the third precoding matrix T_(k) ^(B) can be generated by the equation 9 as described above. The second precoding matrix T_(2,k) ^(A) is a precoding matrix applying to data transmitting to the users in Group A. The second precoding matrix T_(2,k) ^(A) is used for minimizing the BER of signal transmitted to the users in Group A. The third precoding matrix T_(k) ^(B) is a precoding matrix applying to data transmitting to the users in Group B. The third precoding matrix T_(k) ^(B) is used for minimizing the BER of signal transmitted to the users in Group B.

The base station transmits data to users in Group A and Group B (step S120).

By using the generated precoding matrices, the base station transmits the signals to users in Group A and Group B. The signals transmitted to users in Group A can be precoded by the first precoding matrix T_(1,k) ^(A) and the second precoding matrix T_(2,k) ^(A). The signals transmitted to users in Group B can be precoded by the third precoding matrix T_(k) ^(B). The signals precoded by the first precoding matrix T_(1,k) ^(A) and the second precoding matrix T_(2,k) ^(A) can not be demodulated by Eve.

2. Data transmission method when a base station knows imperfect CSI of Eve.

The embodiment of present invention describes the case that only imperfect CSI of Eve is known at the base station. Let Ĥ_(E) denote Eve's CSI known at the base station, which is possibly different from the actual CSI HE. Suppose H_(E) and Ĥ_(E) are related as follows:

Ĥ _(E) =H _(E)+ ε  <equation 9>

where ε represents the uncertainty of Eve's channel. assuming that ε is unknown to the base station; instead, only an upper-bound ε_(TH) of its Frobenius norm is known as follows:

∥ ε∥≦ε_(TH).  <equation 10>

Because the correct channel information for users H_(i) ^(A) and H_(i) ^(B) are available at the base station. However, Ĥ_(E) is only known to Eve. Specifically, T_(1,k) ^(A) which is the first precoding matrix for users in Group A is designed such that the following constraint is satisfied:

H _(i) ^(A) T _(1,k) ^(A) =O, i=1, . . . ,k−1, k+1, . . . ,K ^(A)

H _(i) ^(B) T _(1,k) ^(A) =O, i=1, . . . ,K _(B)

Ĥ _(E) T _(1,k) ^(A) =O  <equation 11>

Then it is easy to see that the received signal at Eve is given as follows:

$\begin{matrix} \begin{matrix} {r_{E} = {{H_{E}{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}T_{2,i}^{A}x_{2,i}^{A}}}} + {H_{E}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + \eta_{E}}} \\ {= {{\left( {{\hat{H}}_{E} + ɛ} \right){\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}T_{2,i}^{A}x_{i}^{A}}}} + {H_{E}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + \eta_{E}}} \\ {= {{ɛ{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}T_{2,i}^{A}x_{i}^{A}}}} + {H_{E}{\sum\limits_{k = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + \eta_{E}}} \end{matrix} & {\langle{{equation}\mspace{14mu} 12}\rangle} \\ {{{where}\mspace{14mu} ɛ} = {- {\overset{\_}{ɛ}.}}} & \; \end{matrix}$

Note that, at Eve, the secret data x_(k) ^(A) is not perfectly eliminated by the precoding T_(1,k) ^(A) due to existence of ε.

FIG. 2 is a conceptual view illustrating the signal received by Eve when the base station does not know channel information of Eve.

According to the FIG. 2, T_(1,k) ^(A) 200 is the first precoding matrix to the users in Group A.

The difference between the actual channel information of Eve and the channel information of Eve given to the base station is ε240. The secret data x_(k) ^(A) is not perfectly eliminated by the precoding matrix T_(1,k) ^(A) 200 due to existence of 240.

In fact, because the exact 240 is unknown, it is never possible to perfectly eliminate the secret data by utilizing any kind of precoding. The embodiment of the present invention propose a scheme which combines BD scheme and jamming scheme. More concretely, A transmit signal adding jamming signal x_(J) may be transmitted by the base station. The transmitting signal adding jamming signal x_(J) is generated as follow:

$\begin{matrix} {x = {{\sum\limits_{i = 1}^{K_{A}}{T_{i}^{A}x_{i}^{A}}} + {\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}} + x_{J}}} & {\langle{{equation}\mspace{14mu} 13}\rangle} \end{matrix}$

The equation 13 represents the transmit signal adding jamming signal x_(J). Let x_(J) denote the jamming vector that is added to the transmitted signal in order to confuse Eve.

The power to transmit signal except the jamming signal is given as follows:

$\begin{matrix} {{\left( {1 - \alpha} \right)P_{Tot}} = {E\left\lbrack {{{\sum\limits_{i = 1}^{K_{A}}{T_{i}^{A}x_{i}^{A}}} + {\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}}}^{2} \right\rbrack}} & {< {{equation}\mspace{14mu} 14} >} \end{matrix}$

According to equation 14, E[∥x∥²]=P_(Tot) again represents the total power. α may be For 0≦α<1, it is assumed that the jamming power portion is αP_(Tot), i.e., E[∥x∥²]=P_(Tot). The remaining power eliminating the jamming power is used for signal transmission.

Then the received signals at the users and Eve are respectively given by equations as follow:

$\begin{matrix} {\mspace{79mu} {{r_{k}^{4} = {{H_{k}^{A}T_{1,k}^{A}T_{2,k}^{A}x_{k}^{A}} + {H_{k}^{A}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + {H_{k}^{A}x_{J}} + \eta_{k}^{A}}}\mspace{79mu} {r_{k}^{B} = {{H_{k}^{B}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + {H_{k}^{B}x_{J}} + \eta_{k}^{B}}}{r_{E} = {{H_{E}{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}T_{2,i}^{A}x_{i}^{A}}}} + {H_{E}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + {H_{E}x_{J}} + \eta_{E}}}}} & {< {{equation}\mspace{14mu} 15} >} \end{matrix}$

where T_(1,k) ^(A) is generated by the way using He described above. The way calculating T_(2,k) ^(A) and T_(1,k) ^(A) are described later. The Jamming signal x_(J) will be designed based on two criterions: i) x_(J) should be effectively designed such that it is working jointly with T_(1,k) ^(A) and ii) x_(J) must not interfere with the legitimate users. To this end, Jamming vector x_(J) satisfying the two criterions given as follow:

$\begin{matrix} {x_{J} = {\sum\limits_{i = 1}^{K_{A}}{F_{1,i}f_{2,i}x_{i}^{J}}}} & {< {{equation}\mspace{14mu} 16} >} \end{matrix}$

where F_(1,i) is an N×L_(i) ^(A) matrix used to jam Eve and f_(2,i) is an L_(i) ^(A)×1 column vector used not to interfere users. The jamming signals x_(i) ^(J) are given by i.i.d. independent random signals. x_(i) ^(J) is a jamming signal generated by a random number. Hereinafter, the following embodiment describes the way determining F_(1,i), f_(2,i), T_(2,k) ^(A) and T_(k) ^(B).

(1) Determining of F_(1,i)

In this embodiment of the present invention, sending the jamming signal in the direction of Ĥ_(E), which is known at the base station is never efficient, because the secret data x_(k) ^(A) is transmitted after being multiplied by the BD based precoder T_(1,k) ^(A).

FIG. 3 is a conceptual view illustrating an embodiment of the received signal power of the secret data at Eve.

According to FIG. 3, first of all, one can see that the received power of the secret data is already zero in the direction of Ĥ_(E) 300, because the precoder T_(1,k) ^(A) is designed to be orthogonal to Ĥ_(E) 300. Therefore, there is no reason to send the jamming signal in the direction of Ĥ_(E) 300. Furthermore, one can see from FIG. 3 that the received power of the secret data is non-zero in the direction of Ĥ_(E)+ε, where Eve is actually located. Note that the amount of the received signal power of the secret data depends on the magnitude of ε.

For example, in FIG. 3, if Eve is located at Ĥ_(E)+ε₂ 340, the received signal power is higher compared to the case of Ĥ_(E)+ε₁ 320. Note, however, that the exact amount of the received power of the secret data at Eve is unknown to the base station, because E is unknown.

Motivated by the discussion above, F_(1,k) may be designed as follow. Clearly, in a particular direction, if the received signal power of the secret data is zero at Eve, no jamming is needed in that direction. In the direction where non-zero signal power of the secret data can be received at Eve, then some jamming is needed. In particular, it is desirable to make the jamming power proportional to the received signal power of the secret data.

FIG. 4 is a conceptual view illustrating an embodiment of the jamming power proportional to the received signal power of the secret data.

According to FIG. 4, no jamming power is required in the direction of Ĥ_(E) 400, and (more) jamming power is required in the direction of Ĥ_(E)+ε with non-zero (larger) ε.

The jamming precoding matrix F_(1,k) is determined as follows:

F _(1,k) =T _(1,k) ^(A)  <equation 17>

Consequently, the received signal at Eve is given as follows:

$\begin{matrix} {r_{E} = {\underset{\underset{(a)}{}}{\sum\limits_{i = 1}^{K_{A}}{ɛ\; T_{1,i}^{A}T_{2,i}^{A}x_{i}^{A}}} + \underset{\underset{(b)}{}}{H_{E}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + \underset{\underset{(c)}{}}{\sum\limits_{i = 1}^{K}{ɛ\; T_{1,i}^{A}f_{2,i}x_{i}^{J}}} + \underset{\underset{(d)}{}}{\eta_{E}}}} & {< {{equation}\mspace{14mu} 18} >} \end{matrix}$

Note that (a) is the signal component and (b) is the transmitting signals to users in Group B, which is the interference at Eve. (c) is the jamming component multiplied by ε and (d) is AWGN (additive white gaussian noise). Determining Jamming precoding matrix as equation 17 has advantageous effect as described below. First of all, the signal component x_(i) ^(A) and the jamming component x_(i) ^(J) are multiplied by ε. Therefore, if more signal power of the secret data is received at Eve due to larger ε, more jamming power is automatically imposed at Eve. If ε happens to be zero (in short, H_(E)=Ĥ_(E)), the power of the signal component is zero. In this case, the jamming component of our proposed scheme automatically also becomes zero.

Substituting F_(1,k)=T_(1,k) ^(A) the received signals at the users are given as follows:

$\begin{matrix} {\begin{matrix} {r_{k}^{A} = {{H_{k}^{A}T_{1,k}^{A}T_{2,k}^{A}x_{k}^{A}} + {H_{k}^{A}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} +}} \\ {{{H_{k}^{A}{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}f_{2,i}x_{i}^{J}}}} + \eta_{k}^{A}}} \\ {= {{H_{k}^{A}T_{1,k}^{A}T_{2,k}^{A}x_{k}^{A}} + {H_{k}^{A}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} +}} \\ {{{H_{k}^{A}T_{1,k}^{A}f_{2,k}x_{k}^{J}} + \eta_{k}^{A}}} \end{matrix}\begin{matrix} {r_{k}^{B} = {{H_{k}^{B}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + {H_{k}^{B}{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}f_{2,i}x_{i}^{J}}}} + \eta_{k}^{B}}} \\ {= {{H_{k}^{B}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + \eta_{k}^{B}}} \end{matrix}} & {< {{equation}\mspace{14mu} 18} >} \end{matrix}$

As represented in equation 18, By using F_(1,k), the jamming signal x_(J) is not received by any users in Group B. This is one of advantages by substituting F_(1,k)=T_(1,k) ^(A). For the users in Group A, however, the received jamming signal is non-zero. To eliminate the received jamming signal, the signal received by users in Group A is described as follows:

$\begin{matrix} {r_{k}^{A} = {{{\overset{\sim}{H}}_{k}^{A}T_{2,k}^{A}x_{k}^{A}} + {H_{k}^{A}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + {{\overset{\sim}{H}}_{k}^{A}f_{2,k}x_{i}^{J}} + \eta_{k}^{A}}} & {< {{equation}\mspace{14mu} 19} >} \end{matrix}$

where {tilde over (H)}_(k) ^(A)=H_(k) ^(A) T_(1,k) ^(A) is a M_(k) ^(A)×L_(k) ^(A) matrix. In the equation 19 described above, {tilde over (H)}_(k) ^(A) f_(2,k) x_(k) ^(J), is the received jamming signal received by users. This received jamming signal should be eliminated. In other words, the vector f_(2,k) is generated to satisfy the equation as follows:

{tilde over (H)} _(k) ^(A) f _(2,k)=0  <equation 20>

To determine f_(2,k) satisfying the condition described above, the SVD of {tilde over (H)}_(k) ^(A) may be determined as follows:

{tilde over (H)} _(k) ^(A) =A _(k)Σ_(k) [B _(k) , B _(k)]^(H)  <equation 21>

where A_(k) is an M_(k) ^(A)×M_(k) ^(A) unitary matrix composed of the left singular vectors of {tilde over (H)}_(k) ^(A). Σ_(k) is a M_(k) ^(A)×L_(k) ^(A) diagonal matrix composed of the singular values. B_(k) is an L_(k) ^(A)×M_(k) ^(A) matrix composed of the right singular vectors corresponding to nonzero singular values, and B _(k) is an L_(k) ^(A)×(L_(k) ^(A)−M_(k) ^(A) matrix composed of the right singular vectors corresponding to zero singular values. Then a single column b _(k) from B _(k) can be selected as f_(2,k) as follows:

f _(2,k) = b _(k)  <equation 22>

For existence of such b _(k), the condition of L_(k)−M_(k)≧1 or L_(k)≧M_(k)+1 must be satisfied. Combined with the condition of N−(M_(E)+M−M_(k))≧L_(k), which was needed for construction of T_(1,k) ^(A), the following equation 23 which is condition of the number of the receiving antenna must be satisfied.

N≧M+M _(E)+1  <equation 23>

Substituting f_(2,k)= b _(k) into equation 19, the received signal can be rewritten as follows:

$\begin{matrix} {r_{k}^{A} = {{H_{k}^{A}T_{1,k}^{A}T_{2,k}^{A}x_{k}^{A}} + {H_{k}^{A}{\sum\limits_{i = 1}^{K_{B}}{T_{i}^{B}x_{i}^{B}}}} + \eta_{k}^{A}}} & {< {{equation}\mspace{14mu} 24} >} \end{matrix}$

As shown in equation 24, users in Group A do not receive the jamming signal. The received signals r_(k) ^(A) and R_(k) ^(B) generated when the base station knows exact CSI of Eve are same as the received signals r_(k) ^(A) and R_(k) ^(B) generated when the base station does not knows exact CSI of Eve. Therefore, the precoding matrices T_(2,k) ^(A) and T_(k) ^(B) may be obtained by the same way described in the case of perfect CSI of Eve. One different thing is transmitting power which can be allocated to the users is (1−α) P_(Tot). (1−α) P_(Tot) is transmission power except the jamming power. Thus, the precoding matrices are shown as follows:

$\begin{matrix} {\; {{{T_{2,k}^{A}(\alpha)} = {{\beta (\alpha)}{{\overset{\_}{T}}_{2,k}^{A}(\alpha)}}}{{T_{k}^{B}(\alpha)} = {{\beta (\alpha)}{{\overset{\_}{T}}_{k}^{B}(\alpha)}}}{{\beta (\alpha)} = \left( \frac{\left( {1 - \alpha} \right)P_{Tot}}{\begin{matrix} {{\sum\limits_{i = 1}^{K_{A}}{{T_{1,i}^{A}{{\overset{\_}{T}}_{2,i}^{A}(\alpha)}}}^{2}} +} \\ {\sum\limits_{i = 1}^{K_{B}}{{{\overset{\_}{T}}_{i}^{B}(\alpha)}}^{2}} \end{matrix}} \right)^{1/2}}{where}{{{\overset{\_}{T}}_{2,k}^{A}(\alpha)} = {\begin{pmatrix} {{\left( {H_{k}^{A}T_{1,k}^{A}} \right)^{H}H_{k}^{A}T_{1,k}^{A}} +} \\ {\frac{\overset{\_}{}}{\left( {1 - \alpha} \right)P_{Tot}}I} \end{pmatrix}^{- 1}\left( {H_{k}^{A}T_{1,k}^{A}} \right)^{H}}}{{{\overset{\_}{T}}_{k}^{B}(\alpha)} = {\begin{pmatrix} \begin{matrix} {{\sum\limits_{i = 1}^{K_{A}}{\left( H_{i}^{A} \right)^{H}H_{i}^{A}}} +} \\ {{\sum\limits_{i = 1}^{K_{B}}{\left( H_{i}^{B} \right)^{H}H_{i}^{B}}} +} \end{matrix} \\ {\frac{\overset{\_}{}}{\left( {1 - \alpha} \right)P_{Tot}}I} \end{pmatrix}^{- 1}\left( H_{k}^{B} \right)^{H}}}{\overset{\_}{} = {{{\sum\limits_{i = 1}^{K_{A}}{_{i}^{A}M_{i}^{A}}} + {\sum\limits_{i = 1}^{K_{B}}{_{i}^{B}M_{i}^{B}}}}..}}}} & {< {{equation}\mspace{14mu} 24} >} \end{matrix}$

According to the embodiment of the present invention, the jamming power optimization may be performed by the base station. Note that T_(2,k) ^(A) and T_(k) ^(B) is the precoding matrixes depends on α and an α is also important parameter to determine jamming power αP_(Tot).

The purpose of the Jamming is to increase bit error rate (BER) of Eve when Eve demodulates data. Signal-to-interference-jamming-noise ratio (SIJNR) represents the state of the signal received at Eve.

Received signal at Eve is represented as follow:

$\begin{matrix} \begin{matrix} {r_{E} = {{ɛ{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}{T_{2,k}^{A}(\alpha)}x_{i}^{A}}}} + {H_{E}{\sum\limits_{i = 1}^{K_{B}}{{T_{i}^{B}(\alpha)}x_{i}^{B}}}} +}} \\ {{{ɛ{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}f_{2,i}x_{i}^{J}}}} + \eta_{E}}} \\ {= {{H_{E}{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}{T_{2,k}^{A}(\alpha)}x_{i}^{A}}}} + {H_{E}{\sum\limits_{i = 1}^{K_{B}}{{T_{i}^{B}(\alpha)}x_{i}^{B}}}} +}} \\ {{{H_{E}{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}f_{2,i}x_{i}^{J}}}} + \eta_{E}}} \end{matrix} & {< {{equation}\mspace{14mu} 25} >} \end{matrix}$

then, SIJNR γ^(E) ^((ε,α)) is represented as follows:

$\begin{matrix} \begin{matrix} {{\gamma^{E}\left( {ɛ,\alpha} \right)} = \frac{E\left\lbrack {{H_{E}{\sum\limits_{i = {1q}}^{K_{A}}{T_{1,i}^{A}{T_{2,k}^{A}(\alpha)}x_{i}^{A}}}}}^{2} \right\rbrack}{E\left\lbrack {\begin{matrix} {{H_{E}{\sum\limits_{i = 1}^{K_{B}}{{T_{i}^{B}(\alpha)}x_{i}^{B}}}} +} \\ {{H_{E}{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}f_{2,i}x_{i}^{J}}}} + \eta_{E}} \end{matrix}}^{2} \right\rbrack}} \\ {= \frac{E\left\lbrack {{ɛ{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}{T_{2,k}^{A}(\alpha)}x_{i}^{A}}}}}^{2} \right\rbrack}{\begin{matrix} {{E\left\lbrack {{H_{E}{\sum\limits_{i = 1}^{K_{B}}{{T_{i}^{B}(\alpha)}x_{i}^{B}}}}}^{2} \right\rbrack} +} \\ \begin{matrix} {{E\left\lbrack {{ɛ{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}f_{2,i}x_{i}^{J}}}}}^{2} \right\rbrack} +} \\ {E\left\lbrack {\eta_{E}}^{2} \right\rbrack} \end{matrix} \end{matrix}}} \end{matrix} & {< {{equation}\mspace{14mu} 26} >} \end{matrix}$

As shown in the equation 26, SIJNR γ^(E) ^((ε,α)) is a function of ε. However, exact value of ε is unknown at the base station. In this work, for analytical tractability, an upper bound and a lower bound of γ^(E) ^((ε,α)) can be considered and then derive the worst-case SIJNRs of the bounds. Using the triangular inequality, a lower bound of SIJNR is represented as follows:

$\begin{matrix} {{\gamma^{E}\left( {ɛ,\alpha} \right)} \geq {\left( {E\left\lbrack {{ɛ{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}{T_{2,k}^{A}(\alpha)}x_{i}^{A}}}}}^{2} \right\rbrack} \right){\quad\left( {{E\left\lbrack {{{\hat{H}}_{E}{\sum\limits_{i = 1}^{K_{B}}{{T_{i}^{B}(\alpha)}x_{i}^{B}}}}}^{2} \right\rbrack} + {\quad{{E\left\lbrack {{ɛ{\sum\limits_{i = {1q}}^{K_{B}}{{T_{i}^{B}(\alpha)}x_{i}^{B}}}}}^{2} \right\rbrack} + {\left. \quad{{E\left\lbrack {{ɛ{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}f_{2,i}x_{i}^{J}}}}}^{2} \right\rbrack} + {E\left\lbrack {\eta_{E}}^{2} \right\rbrack}} \right)^{- 1}\text{=:}{{\gamma_{L}^{E}\left( {ɛ,\alpha} \right)}.}}}}} \right.}}} & {< {{equation}\mspace{14mu} 27} >} \end{matrix}$

and a higher bound of SIJNR is represented as follows:

$\begin{matrix} {{\gamma^{E}\left( {ɛ,\alpha} \right)} \leq {\frac{E\left\lbrack {{ɛ{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}{T_{2,k}^{A}(\alpha)}x_{i}^{A}}}}}^{2} \right\rbrack}{{E\left\lbrack {{ɛ{\sum\limits_{i = 1}^{K_{A}}{T_{1,i}^{A}f_{2,i}x_{i}^{J}}}}}^{2} \right\rbrack} + {E\left\lbrack {\eta_{E}}^{2} \right\rbrack}}\text{=:}{{\gamma_{U}^{E}\left( {ɛ,\alpha} \right)}.}}} & {< {{equation}\mspace{14mu} 28} >} \end{matrix}$

the worst case SIJNR is derived by the lower bound of SIJNR and the higher bound of SIJNR.

$\begin{matrix} {{{\max\limits_{\{{ɛ:{{ɛ} \leq ɛ_{TH}}}\}}{\gamma_{L}^{E}\left( {ɛ,\alpha} \right)}} = {\lambda_{{ma}\; x}\left( {_{L}(\alpha)} \right)}}{{\max\limits_{\{{ɛ:{{ɛ} \leq ɛ_{TH}}}\}}{\gamma_{U}^{E}\left( {ɛ,\alpha} \right)}} = {\lambda_{{ma}\; x}\left( {_{U}(\alpha)} \right)}}} & {< {{equation}\mspace{14mu} 29} >} \end{matrix}$

provided, equation 30 should be satisfied.

_(L)(α)=(R _(I)(α)+R _(J)(α)+R _(N))⁻¹ R _(S)(α)

_(U)(α)=(R _(J)(α)+R _(N))⁻¹ R _(S)(α).  <equation 30>

The equation represented above, R_(S)(α), R_(I)(α), R_(J)(α), and R_(N)(α) are given as follows:

$\begin{matrix} {{{R_{S}(\alpha)} = {\sum\limits_{k = 1}^{K_{A}}{\sum\limits_{i = 1}^{N_{k}^{A}}{\left( {\left( {t_{k,i}^{A}(\alpha)} \right)^{T} \otimes I_{M_{E} \times M_{E}}} \right)^{H}\left( {\left( {t_{k,i}^{A}(\alpha)} \right)^{T} \otimes I_{M_{E} \times M_{E}}} \right)}}}}{{R_{I}(\alpha)} = {{\frac{1}{ɛ_{TH}^{2}}\left( {\sum\limits_{k = 1}^{K_{B}}{\sum\limits_{i = 1}^{N_{k}^{B}}{\left( {t_{k,i}^{B}(\alpha)} \right)^{H}{\hat{H}}_{E}^{H}{\hat{H}}_{E}{t_{k,i}^{B}(\alpha)}}}} \right)I_{{NM}_{E} \times {NM}_{E}}} + {\sum\limits_{k = 1}^{K_{B}}{\sum\limits_{i = 1}^{N_{k}^{B}}{\left( {\left( {t_{k,i}^{B}(\alpha)} \right)^{T} \otimes I_{M_{E} \times M_{E}}} \right)^{H}\left( {\left( {t_{k,i}^{A}(\alpha)} \right)^{T} \otimes I_{M_{E} \times M_{E}}} \right)}}}}}{{R_{J}(\alpha)} = {\frac{\alpha \; P_{Tot}}{{{\sum\limits_{k = 1}^{K_{A}}{T_{1,k}^{A}f_{2,k}}}}^{2}}{\sum\limits_{k = 1}^{K_{A}}{\left( {\left( {T_{1,k}^{A}f_{2,k}} \right)^{T} \otimes I_{M_{E} \times M_{E}}} \right)^{H}\left( {\left( {T_{1,k}^{A}f_{2,k}} \right)^{T} \otimes I_{M_{E} \times M_{E}}} \right)}}}}\mspace{79mu} {R_{N} = {\frac{_{E}M_{E}}{ɛ_{TH}^{2}}I_{{NM}_{E} \times {NM}_{E}}}}} & {< {{equation}\mspace{14mu} 31} >} \end{matrix}$

where

denotes the Kronecker product, t_(k,i) ^(A)(α) is the i-th column of T_(k) ^(A)(α)=T_(1,k) ^(A) T_(2,k) ^(A)(α), and t_(k,i) ^(B)(α) is the i-th column of T_(k) ^(B)(α).

For optimization of α, the maximum SIJNR of Eve must be constrained to be a pre-determined threshold γTH. Note that the γTH value should be chosen appropriately in order to ensure that the decoding error probability at Eve is high enough and this will be numerically demonstrated in the next section. Given γTH, we can determine the minimum jamming power, α_(opt) P_(Tot), using the derived worst-case SIJNR expressions as follows:

$\begin{matrix} {{\alpha_{opt} = {{\min\limits_{0 \leq \alpha < 1}{\alpha \mspace{14mu} {subject}\mspace{14mu} {to}\mspace{14mu} {\lambda_{m\; {ax}}\left( {(\alpha)} \right)}}} \leq \gamma_{TH}}}{{{where}\mspace{14mu} {(\alpha)}} \in {\left\{ {{_{L}(\alpha)},{_{U}(\alpha)}} \right\}.}}} & {< {{equation}\mspace{14mu} 32} >} \end{matrix}$

FIG. 5 is a flowchart illustrating the secure data transmission method when a base station does not know perfect CSI of Eve.

FIG. 5 illustrates the secure data generating method of the base station.

According to FIG. 5, a base station generates the first precoding matrix based on estimated channel information of Eve (step S500).

A procedure of generating the first precoding matrix T_(1,k) ^(A) is described in the equation 11. The first precoding matrix T_(1,k) ^(A) is a precoding matrix applying to data transmitting to the users in Group A, the data transmitting to whom must be kept secret at the physical layer from all other users as well as Eve. The first precoding matrix T_(1,k) ^(A) can be used for protecting users' data in Group A from other users. The first precoding matrix T_(1,k) ^(A) described in FIG. 5 is different with the first precoding matrix T_(1,k) ^(A) described in FIG. 1, because the first precoding matrix T_(1,k) ^(A) described in FIG. 5 is derived based on an assumption that the base station does not know perfect CSI of Eve.

The base station generates the jamming vector (step S510).

The jamming vector is generated by the equation 16 described above.

As shown in the equation 16, a jamming precoding matrix and a column vector can be used to generate the jamming vector. The jamming precoding matrix is generated by the equation 17, and the column vector is generated by the equation 22. The jamming precoding vector is a vector used for transmitting the jamming signal to the adjacent directions of H_(E) except the exact direction of H_(E). The column vector is used not to interfere the users in Group A and Group B.

The base station generates the second precoding matrix and the third precoding matrix (step S520).

The second precoding matrix T_(2,k) ^(A) and the third precoding matrix T_(k) ^(B) can be generated by the equation 24 as described above. The second precoding matrix T_(2,k) ^(A) is a precoding matrix applying to data transmitting to the users in Group A. The second precoding matrix T_(2,k) ^(A) is used for minimizing the BER of signal transmitted to the users in Group A. The third precoding matrix T_(k) ^(B) is a precoding matrix applying to data transmitting to the users in Group B. The third precoding matrix T_(k) ^(B) is used for minimizing the BER of signal transmitted to the users in Group B. The second precoding matrix T_(2,k) ^(A) and the third precoding matrix T_(k) ^(B) described in FIG. 5 is different with the second precoding matrix T_(2,k) ^(A) and the third precoding matrix T_(k) ^(B) described in FIG. 1, because the second precoding matrix T_(2,k) ^(A) and the third precoding matrix T_(k) ^(B) described in FIG. 5 is derived based on an assumption that the base station does not know perfect CSI of Eve.

The base station calculates the optimal jamming power (step S530).

The optimal jamming power can be calculated by the equation 29 and equation 32. To satisfying the purpose of using the jamming signal, the base station should determine the optimal jamming power. The base station can determine the optimal jamming power by applying the higher bound and the lower bound of signal to interference jamming noise ratio (SIJNR).

The base station transmits data to users in Group A and Group B (step S540).

By using the generated precoding matrices and the jamming vector, the base station transmits the signals to users in Group A and Group B. The signals transmitted to users in Group A can be precoded by the first precoding matrix T_(1,k) ^(A) and the second precoding matrix T_(2,k) ^(A). The signals transmitted to users in Group B can be precoded by the third precoding matrix T_(k) ^(B). Both signals transmitted to Group A and Group B may include the jamming signal. The signals precoded by the second precoding matrix T_(2,k) ^(A) and the third precoding matrix T_(k) ^(B) and including the jamming signal can not be demodulated by Eve.

FIG. 6 is a block diagram showing a BS and a UE.

A BS 600 includes a processor 610, a memory 620, and a radio frequency (RF) unit 630. The processor 610 implements the proposed functions, procedures, and/or methods. For example, the processor 610 can determine the first precoding matrix based on actual channel information of an eavesdropper and determine the second precoding matrix and the third precoding matrix based on the first precoding matrix and transmit a signal to at least one user in a first group or at least one user in a second group. The memory 620 is coupled to the processor 610, and stores a variety of information for driving the processor 610. The RF unit 630 is coupled to the processor 610, and transmits and/or receives a radio signal.

A UE 650 includes a processor 660, a memory 670, and an RF unit 680. The processor 660 implements the proposed functions, procedures, and/or methods. For example, the processor 660 can receive the signal precoded by the first precoding matrix, second precoding matrix or the signal precoded by the third precoding matrix. The memory 620 is coupled to the processor 610, and stores a variety of information for driving the processor 610. The RF unit 630 is coupled to the processor 610, and transmits and/or receives a radio signal.

The processors 610 and 660 may include an application-specific integrated circuit (ASIC), a separate chipset, a logic circuit, and/or a data processing unit and/or a converter for mutually converting a baseband signal and a radio signal. The memory 620 and 670 may include a read-only memory (ROM), a random access memory (RAM), a flash memory, a memory card, a storage medium, and/or other equivalent storage devices. The RF units 630 and 680 may include a base-band circuit for processing a radio signal. When the embodiment of the present invention is implemented in software, the aforementioned methods can be implemented with a module (i.e., process, function, etc.) for performing the aforementioned functions. The module may be stored in the memories 620 and 670 and may be performed by the processors 610 and 660. The memories 620 and 670 may be located inside or outside the processors 610 and 660, and may be coupled to the processors 610 and 660 by using various well-known means.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the scope of the invention is defined not by the detailed description of the invention but by the appended claims, and all differences within the scope will be construed as being included in the present invention. 

What is claimed is:
 1. A method of transmitting secure data by a base station, the method comprising: determining a first precoding matrix based on channel information of an eavesdropper; determining a second precoding matrix and a third precoding matrix; generating the secure data by precoding first user data for a target user with the first precoding matrix and the second precoding matrix; and transmitting the secure data signal to the target user, wherein the first precoding matrix is determined by selecting at least one column of a matrix {tilde over (V)}_(i), wherein the {tilde over (V)}_(i) is determined based on first channel information between the base station and the target user, second channel information between the base station and a non-secured user, and third channel information between the base station and the eavesdropper, wherein the second precoding matrix is determined based on the first precoding matrix and the first channel information, and wherein and the third precoding matrix is determined based on the first channel information and the second channel information.
 2. The method of claim 1, wherein the first precoding matrix is used to precode the first user data so that the secure data is not decoded by the eavesdropper and the second precoding matrix is used to precode the first user data to minimize decoding error, wherein the third precoding matrix is used to precode second user data for the non-secured user.
 3. The method of claim 1, wherein the first precoding matrix of k-th target user is T_(1,k) ^(A), wherein the T_(1,k) ^(A) is determined to satisfy: H _(i) ^(A) T _(1,k) ^(A) =O, i=1, . . . ,k−1, k+1, . . . , K ^(A) H _(i) ^(B) T _(1,k) ^(A) =O, i=1, . . . ,K _(B) H _(E) T _(1,k) ^(A) =O wherein the H_(i) ^(A)(1≦i≦K_(A), K_(A) is a number of the target users) is the first precoding matrix representing the first channel information from the base station to the i-th target user, wherein the H_(i) ^(B)(1≦i≦K_(B), K_(B) is a number of the non-secured user) is the second precoding matrix representing the second channel information from the base station to the i-th non secured user, and wherein the H_(E) is the third precoding matrix representing channel information from the base station to the eavesdropper.
 4. The method of claim 1, wherein the second precoding matrix of k-th target user is T_(2,k) ^(A) and the third precoding matrix of k-th non-secured user in the second group is T_(k) ^(B), wherein the T_(2,k) ^(A) is determined based on the T_(1,k) ^(A) and H_(k) ^(A) which is the first channel information of k-th secured user, wherein the T_(k) ^(B) is determined based on the H_(i) ^(A) and the H_(i) ^(B).
 5. A method of transmitting secure data of a base station, the method comprising: determining a first precoding matrix based on estimated channel information of an eavesdropper; determining a jamming vector based on the first precoding matrix; determining jamming power; determining a second precoding matrix and a third precoding matrix; and transmitting the secured data signal including a jamming signal to a target user, wherein the first precoding matrix of k-th target user is T_(1,k) ^(A), wherein the T_(1,k) ^(A) is determined to satisfy: H _(i) ^(A) T _(1,k) ^(A) =O, i=1, . . . ,k−1, k+1, . . . ,K ^(A) H _(i) ^(B) T _(1,k) ^(A) =O, i=1, . . . ,K _(B) Ĥ _(E) T _(1,k) ^(A) =O wherein the H_(i) ^(A)(1≦i≦K_(A), K_(A) is a number of the target users) is the first precoding matrix representing a first channel information from the base station to the i-th target user, wherein the H_(i) ^(B)(1≦i≦K_(B), K_(B) is a number of the non-secured user) is the second precoding matrix representing a second channel information from the base station to the i-th non secured user, and wherein the Ĥ_(E) is the third precoding matrix representing the estimated channel information from the base station to the eavesdropper.
 6. The method of claim 5, wherein the first precoding matrix is used to precode the first user data so that the secure data is not decoded by the eavesdropper and the second precoding matrix is used to precode the first user data to minimize decoding error, wherein the third precoding matrix is used to precode second user data for the non-secured user.
 7. The method of claim 5, wherein the determining a jamming vector based on the first precoding matrix is performed based on the F_(1,k), which is the first precoding matrix of k-th target user and x_(i) ^(J), which is a jamming signal generated by a random number.
 8. The method of claim 5, wherein the determining jamming power comprises, determining SIJNR (signal-to-interference-jamming-noise ratio) of the receiving signal at the eavesdropper; determining a higher bound and a lower bound of the SIJNR; and determining the jamming power based on the higher bound and the lower bound of the SIJNR.
 9. A base station for wireless communication, the base station comprising: a processor for determining a first precoding matrix based on channel information of an eavesdropper; determining a second precoding matrix and a third precoding matrix; generating the secure data by precoding first user data for a target user with the first precoding matrix and the second precoding matrix; and transmitting the secure data signal to the target user, wherein the first precoding matrix is determined by selecting at least one column of a matrix {tilde over (V)}_(i), wherein the {tilde over (V)}_(i) is determined based on first channel information between the base station and the target user, second channel information between the base station and a non-secured user, and third channel information between the base station and the eavesdropper, and wherein the second precoding matrix is determined based on the first precoding matrix and the first channel information and the third precoding matrix is determined based on the first channel information and the second channel information.
 10. The base station of claim 9, wherein the first precoding matrix is used to precode the first user data so that the secure data is not decoded by the eavesdropper and the second precoding matrix is used to precode the first user data to minimize decoding error, wherein the third precoding matrix is used to precode second user data for the non-secured user.
 11. The base station of claim 9, wherein the first precoding matrix of k-th target user is T_(1,k) ^(A), wherein the T_(1,k) ^(A) is determined to satisfy: H _(i) ^(A) T _(1,k) ^(A) =O, i=1, . . . ,k−1, k+1, . . . ,K _(A) H _(i) ^(B) T _(1,k) ^(A) =O, i=1, . . . ,K _(B) Ĥ _(E) T _(1,k) ^(A) =O wherein the H_(i) ^(A)(1≦i≦K_(A), K_(A) is a number of the target users) is the first precoding matrix representing the first channel information from the base station to the i-th target user, wherein the H_(i) ^(B)(1≦i≦K_(B), K_(B) is a number of the non-secured user) is the second precoding matrix representing the second channel information from the base station to the i-th non secured user, and wherein the H_(E) is the third precoding matrix representing channel information from the base station to the eavesdropper.
 12. The base station of claim 9, wherein the second precoding matrix of k-th target user is T_(2,k) ^(A) and the third precoding matrix of k-th non-secured user in the second group is T_(k) ^(B), wherein the T_(2,k) ^(A) is determined based on the T_(1,k) ^(A) and H_(k) ^(A) which is the first channel information of k-th secured user, wherein the T_(k) ^(B) is determined based on the H_(i) ^(A) and the H_(i) ^(B).
 13. The base station of claim 12, wherein the processor is configured to: determine a jamming vector based on the first precoding matrix; and determine jamming power.
 14. The base station of claim 12, wherein the processor configured to determine a jamming vector based on the first precoding matrix is performed based on the F_(1,k), which is the first precoding matrix of k-th target user and x_(i) ^(J), which is a jamming signal generated by a random number.
 15. The base station of claim 12, wherein the processor configured to determine jamming power by: determining SIJNR (signal-to-interference-jamming-noise ratio) of the receiving signal at the eavesdropper; determining a higher bound and a lower bound of the SIJNR; and determining the jamming power based on the higher bound and the lower bound of the SIJNR. 